Model Checking Algorithms for Hyperproperties (Invited Paper)

Hyperproperties generalize trace properties by expressing relations between multiple computations. Hyperpropertes include policies from information-flow security, like observational determinism or noninterference, and many other system including promptness knowledge. In this paper, we give an overview on the model checking problem for temporal hyperlogics. Our starting point is algorithm HyperLTL, a reduction to Büchi automata emptiness. This basic construction can be extended with propositional quantification, resulting in HyperQPTL. It also branching time, HyperCTL $$^*$$ . However, it not possible have both extensions at same time: of HyperQCTL undecidable. An attractive compromise offered MPL[E], i.e., monadic path logic equal-level predicate. The expressiveness MPL[E] falls strictly that subsumes HyperKCTL , extension knowledge operator. We show still decidable.